A refinement of H. C. Williams’ $q$th root algorithm
نویسندگان
چکیده
منابع مشابه
H–C residual dipolar coupling on refinement
Ribonucleic acid structure determination by NMR spectroscopy relies primarily on local structural restraints provided by H–H NOEs and J-couplings. When employed loosely, these restraints are broadly compatible with Aand B-like helical geometries and give rise to calculated structures that are highly sensitive to the force fields employed during refinement. A survey of recently reported NMR stru...
متن کاملAn Adaptive h-Refinement Algorithm for Local Damage Models
An adaptive mesh refinement strategy is proposed for local damage models that often arise from internal state variable based continuum damage models. The proposed algorithm employs both the finite element method and the finite difference method to integrate the equations of motion of a linear elastic material with simple isotropic microcracking. The challenges of this problem include the time i...
متن کاملA Refinement of Shor’s Algorithm
A refinement of Shor’s Algorithm for determining order is introduced in which the algorithm determines a divisor of the order after any one run of the quantum computer with almost absolute certainty. The information garnered from each run of the quantum computer is then accumulated to determine the order with almost absolute certainty, and with a minimum probability of determining the order aft...
متن کاملGeorge C Williams Prize 2015
Center for Infectious Disease Dynamics, Departments of Biology and Entomology, Pennsylvania State University, University Park, PA 16802, USA; Department of Anthropology and Wolfson Research Institute for Health and Wellbeing, Durham University, Durham, UK and Department of Organismic and Evolutionary Biology, Harvard University, Cambridge, MA 02138, USA *Corresponding author. Center for Infecti...
متن کاملRoot Refinement for Real Polynomials
We consider the problem of approximating all real roots of a square-free polynomial f . Given isolating intervals, our algorithm refines each of them to a width of 2−L or less, that is, each of the roots is approximated to L bits after the binary point. Our method provides a certified answer for arbitrary real polynomials, only considering finite approximations of the polynomial coefficients an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1993
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1993-1182249-0